Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Auteurs » - entrée « Pierre Lescanne »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Pierre Lebon < Pierre Lescanne < Pierre Leschanne  Facettes :

List of bibliographic references indexed by Pierre Lescanne

Number of relevant bibliographic references: 86.
[0-50] [0 - 20][0 - 50][50-70]
Ident.Authors (with country if any)Title
001425 (2013) Pierre Lescanne [France]Les krachs sont rationnels
001620 (2013) Pierre Lescanne [France]Common Knowledge Logic in a Higher Order Proof Assistant
001656 (2013) Pierre Lescanne [France]A Simple Case of Rationality of Escalation
001D80 (2012) Pierre Lescanne [France] ; Matthieu Perrinel [France]“Backward” coinduction, Nash equilibrium and the rationality of escalation
002678 (2011) Silvia Ghilezan [Serbie] ; Jelena Iveti [Serbie] ; Pierre Lescanne [France] ; Silvia Likavec [Italie]Intersection Types for the Resource Control Lambda Calculi
004C32 (2007) Pierre Lescanne [France]Mechanizing common knowledge logic using COQ
005290 (2006) Daniel J. Dougherty [États-Unis] ; Pierre Lescanne [France] ; Luigi LiquoriAddressed term rewriting systems: application to a typed object calculus
007894 (2003) Dan Dougherty [États-Unis] ; Pierre Lescanne [France]Reductions, intersection types, and explicit substitutions
009822 (2000) Frederic Lang ; Pierre Lescanne [France] ; Luigi Liquori ; Dan Dougherty ; Rose KristofferA Generic Object-Calculus Based on Addressed Term Rewriting Systems
00BE81 (1996) Z. Benaissa ; Daniel Briaud ; Pierre Lescanne [France] ; J. Rouyer-DegliLambda upsilon, A Calculus of Explicit Substitutions which Preserves Strong Normalisation
00BF09 (1996) Pierre Lescanne [France]La science informatique en Lorraine
00BF26 (1996) Zine-El-Abidine Benaissa [France] ; Daniel Briaud [France] ; Pierre Lescanne [France] ; Jocelyne Rouyer-Degli [France]λν, a calculus of explicit substitutions which preserves strong normalisation
00BF28 (1996) Gregory Kucherov [France] ; Pierre Lescanne [France] ; Peter Mosses [Danemark]Valentin Antimirov (1961–1995)
00C010 (1996) Pierre Lescanne [France]The lambda calculus as an abstract data type
00C054 (1996) Zine-El-Abidine Benaissa [France] ; Pierre Lescanne [France] ; Kristoffer H. Rose [Danemark]Modeling sharing and recursion for weak reduction strategies using explicit substitution
00C136 (1996) G. Kucherov [France] ; Pierre Lescanne [France] ; P. Mosses [Danemark]Valentin Antimirov (1961-1995)
00C308 (1995) B. Chetali ; Pierre Lescanne [France]Formal Verification of a Protocol for Communications over Faulty Channels
00C374 (1995) Pierre Lescanne [France] ; J. Rouyer-DegliExplicit Substitutions with de Bruijn's Levels
00C413 (1995) Z. Benaissa ; Pierre Lescanne [France]Triad Machine ; A General Computational Model for the Description of Abstract Machines
00C531 (1995) Pierre Lescanne [France]Termination of rewrite systems by elementary interpretations
00C698 (1995) Pierre Lescanne [France]Termination of rewrite systems by elementary interpretations
00C756 (1995) Pierre Lescanne [France] ; Jocelyne Rouyer-Degli [France]Explicit substitutions with de bruijn's levels
00C970 (1994) J. Rouyer ; Pierre Lescanne [France]Verification and Programming of First-order Unification, in the Calculus of Constructions with Inductive Type
00CA28 (1994) Z. Benaissa ; Pierre Lescanne [France]A Suitable Environments for an Efficient Calculus of Explicit Substitutions
00CA65 (1994) Pierre Lescanne [France]From λσ to λ\upsilon, a Journey through Calculi of Explicit Substitutions
00CB51 (1994) Pierre Lescanne [France]An Introduction to ORME
00CB73 (1994) Pierre Lescanne [France]On Termination of one Rule Rewrite Systems
00CC11 (1994) Pierre Lescanne [France] ; J. Rouyer-DegliThe Calculus of Explicit Substitutions λ\upsilon
00D259 (1992) Pierre Lescanne [France]Well Rewrite Orderings and Well Quasi-Orderings
00D410 (1992) B. Chetali ; Pierre Lescanne [France]An Exercice in LP : The Proof of a Non Restoring Division Circuit
00D412 (1992) E. A. Cichon ; Pierre Lescanne [France]Polynomial Interpretations and the Complexity of Algorithms
00D467 (1992) J. Hsiang ; H. Kirchner ; Pierre Lescanne [France] ; M. RusinowitchThe Term Rewriting Approach to Automated Theorem Proving
00D476 (1992) Pierre Lescanne [France]Termination of Rewrite Systems by Elementary Interpretations
00D631 (1992) Pierre Lescanne [France]Termination of rewrite systems by elementary interpretations
00D649 (1992) Adam Cichon [France] ; Pierre Lescanne [France]Polynomial interpretations and the complexity of algorithms
00D735 (1991) Pierre Lescanne [France]Well Rewrite Orderings and Well Quasi-Orderings
00D806 (1991) Pierre Lescanne [France]Rewrite Orderings and Termination of Rewrite Systems
00D843 (1991) Pierre Lescanne [France]Proving Identities in Commutative Semigroups and Monoids : An Automaton Approach
00D925 (1991) Pierre Lescanne [France]Termination of Rewrite Systems by Elementary Interpretations
00DA44 (1991) Pierre Lescanne [France]Rewrite orderings and termination of rewrite systems
00DC06 (1990) Pierre Lescanne [France]Implementation of Completion by Transition Rules + Control : ORME
00DC56 (1990) Pierre Lescanne [France]ORME : an Implementation of Completion Procedures as Sets of Transition Rules
00DC63 (1990) F. Bellegarde ; Pierre Lescanne [France]Termination by Completion
00DD20 (1990) A. Lazrek ; Pierre Lescanne [France] ; J.-J. ThielTools for Proving Inductive Equalities, Relative Completeness, and \omega Completeness
00DD32 (1990) M. Dauchet ; T. Heuillard ; Pierre Lescanne [France] ; S. TisonDecidability of the Confluence of Finite Ground Term Rewrite Systems and of other Related Term Rewrite Systems
00DE15 (1990) Françoise Bellegarde [États-Unis] ; Pierre Lescanne [France]Termination by completion
00DE26 (1990) Pierre Lescanne [France]Orme an implementation of completion procedures as sets of transitions rules
00DE27 (1990) Pierre Lescanne [France]On the recursive decomposition ordering with lexicographical status and other related orderings
00DE36 (1990) Pierre Lescanne [France]Implementation of completion by transition rules + control: ORME
00DF46 (1989) H. Comon ; Pierre Lescanne [France]Equational Problems and Disunification
00DF67 (1989) Pierre Lescanne [France]Completion Procedures as Transition Rules + Control

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Author.i -k "Pierre Lescanne" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Author.i  \
                -Sk "Pierre Lescanne" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Author.i
   |clé=    Pierre Lescanne
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022